The reflexive and Hermitian reflexive solutions of the generalized Sylvester-conjugate matrix equation
نویسندگان
چکیده
منابع مشابه
Iterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملGradient Based Iterative Algorithm for Solving the Generalized Coupled Sylvester-transpose and Conjugate Matrix Equations over Reflexive (anti-reflexive) Matrices
Linear matrix equations play an important role in many areas, such as control theory, system theory, stability theory and some other fields of pure and applied mathematics. In the present paper, we consider the generalized coupled Sylvestertranspose and conjugate matrix equations Tν(X) = Fν , ν = 1, 2, . . . , N, where X = (X1, X2, . . . , Xp) is a group of unknown matrices and for ν = 1, 2, . ...
متن کاملAn Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations
An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...
متن کاملiterative algorithm for the generalized $(p,q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
in the present paper, we propose an iterative algorithm for solving the generalized $(p,q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} {underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$. by this iterative algorithm, the solvability of the problem can be determined automatically. when the matrix equation is consistent over...
متن کاملGeneralized reflexive solutions of the matrix equation AXB=D and an associated optimal approximation problem
Generalized reflexive solutions of the matrix equation AXB = D and an associated optimal approximation problem a b s t r a c t
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2013
ISSN: 1370-1444
DOI: 10.36045/bbms/1382448185